On the Combinatorial Structure of Arrangements of Oriented Pseudocircles

نویسندگان

  • Johann Linhart
  • Ronald Ortner
چکیده

We introduce intersection schemes (a generalization of uniform oriented matroids of rank 3) to describe the combinatorial properties of arrangements of pseudocircles in the plane and on closed orientable surfaces. Similar to the FolkmanLawrence topological representation theorem for oriented matroids we show that there is a one-to-one correspondence between intersection schemes and equivalence classes of arrangements of pseudocircles. Furthermore, we consider arrangements where the pseudocircles separate the surface into two components. For these strict arrangements there is a one-to-one correspondence to a quite natural subclass of consistent intersection schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embeddability of Arrangements of Pseudocircles into the Sphere

An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in [6] so-called intersection schemes were introduced. Building up on results about the latter, we first clarify the notion of embedding of an arrangement. Once this is do...

متن کامل

Arrangements of Pseudocircles: Triangles and Drawings

A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Grünbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two crossings. Grünbaum conjectured that the number of triangular cells p3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n−4. We p...

متن کامل

Arrangements of Pseudocircles: On Circularizability

An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that every pair is either disjoint or intersects in exactly two crossing points. We call an arrangement intersecting if every pair of pseudocircles intersects twice. An arrangement is circularizable if there is a combinatorially equivalent arrangement of circles. Kang and Müller showed tha...

متن کامل

UPPER BOUNDS ON THE NUMBER OF VERTICES OF WEIGHT ≤ k IN PARTICULAR ARRANGEMENTS OF PSEUDOCIRCLES

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight ≤ k in certain arrangements of pseudocircles in the plane. In particular, forbidding certain subarrangements we improve the known bound of 6n − 12 (cf. [2]) for verti...

متن کامل

Improved Upper Bounds on the Number of Vertices of Weight ≤ k in Particular Arrangements of Pseudocircles

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight ≤ k in certain arrangements of pseudocircles in the plane.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2004